Efficient approximate solution of sparse linear systems
نویسندگان
چکیده
منابع مشابه
Eecient Approximate Solution of Sparse Linear Systems
We consider the problem of approximate solution e x of a linear system Ax = b over the reals, such that kAe x ? bk kbk; for a given ; 0 < < 1: This is one of the most fundamental of all computational problems. Let (A) = kAkkA ?1 k be the condition number of the n n input matrix A. Sparse, diagonally dominant (DD) linear systems appear very frequently in the solution of linear systems associated...
متن کاملE cient Approximate Solution of Sparse Linear Systems
We consider the problem of approximate solution e x of a linear system Ax = b over the reals, such that kAe x bk kbk; for a given ; 0 < < 1: This is one of the most fundamental of all computational problems. Let (A) = kAkkA k be the condition number of the n n input matrix A. Sparse, diagonally dominant (DD) linear systems appear very frequently in the solution of linear systems associated with...
متن کاملFast and Efficient Parallel Solution of Sparse Linear Systems
This paper presents a parallel algorithm for the solution of a linear system Ax = b with a sparse n n symmetric positive deenite matrix A, associated with the graph G(A) that has n vertices and has an edge for each nonzero entry of A. If G(A) has an s(n)-separator family and a known s(n)-separator tree, then the algorithm requires only O(log 3 n) time and (jEj+M(s(n)))= log n processors for the...
متن کاملThe Efficient Parallel Iterative Solution of Large Sparse Linear Systems
The development of eecient, general-purpose software for the iterative solution of sparse linear systems on a parallel MIMD computer requires an interesting combination of expertise. Parallel graph heuristics, convergence analysis, and basic linear algebra implementation issues must all be considered. In this paper, we discuss how we have incorporated recent results in these areas into a genera...
متن کاملSolution of Sparse Linear Systems
We consider the solution of a linear system Ax = b on a distributed memory machine when the matrix A is large, sparse and symmetric positive deenite. In a previous paper we developed an algorithm to compute a ll-reducing nested dissection ordering of A on a distributed memory machine. We n o w develop algorithms for the remaining steps of the solution process. The large-grain task parallelism r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1998
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(98)00191-6